Evaluation Study for Delay and Link Utilization with the New-Additive Increase Multiplicative Decrease Congestion Avoidance and Control Algorithm
نویسندگان
چکیده
As the Internet becomes increasingly heterogeneous, the issue of congestion avoidance and control becomes ever more important. And the queue length, end-to-end delays and link utilization is some of the important things in term of congestion avoidance and control mechanisms. In this work we continue to study the performances of the New-AIMD (Additive Increase Multiplicative Decrease) mechanism as one of the core protocols for TCP congestion avoidance and control algorithm, we want to evaluate the effect of using the AIMD algorithm after developing it to find a new approach, as we called it the New-AIMD algorithm to measure the Queue length, delay and bottleneck link utilization, and use the NCTUns simulator to get the results after make the modification for the mechanism. And we will use the Droptail mechanism as the active queue management mechanism (AQM) in the bottleneck router. After implementation of our new approach with different number of flows, we expect the delay will less when we measure the delay dependent on the throughput for all the system, and also we expect to get end-to-end delay less. And we will measure the second type of delay a (queuing delay), as we shown in the figure 1 bellow. Also we will measure the bottleneck link utilization, and we expect to get high utilization for bottleneck link with using this mechanism, and avoid the collisions in the link.
منابع مشابه
Experimental Evaluation of Bottleneck Link Utilization with New-Additive Increase Multiplicative Decrease Congestion Avoidance and Control Algorithm
Problem statement: As the Internet becomes increasingly heterogeneous, the issue of congestion control becomes ever more important. And the link utilization is one of the important things in term of congestion avoidance and control mechanisms. And we can define the utilization as simply the throughput divided by the access rate. And also all the developments for the congestion control and avoid...
متن کاملQTCP: An Optimized and Improved Congestion Control Algorithm of High-Speed TCP Networks
TCP researchers evaluated the performance and fairness of different TCP protocols on the basis of new algorithms. The new High-Speed Transport Control Protocols (HS-TCP) were developed but there are still many problems regarding to bandwidth utilization, throughput and packet loss rate. To overcome these problems Quick Transport Control Protocol (QTCP) algorithm based on optimizations of HS-TCP...
متن کاملAnalysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks
Congestion avoidance mechanisms allow a network to operate in the optimal region of low delay and high throughput, thereby, preventing the network from becoming congested. This is different from the traditional congestion control mechanisms that allow the network to recover from the congested state of high delay and low throughput. Both congestion avoidance and congestion control mechanisms are...
متن کاملVEGAS RB+: An Optimized Version of TCP VEGAS
TCP Vegas is a well-known delay-based congestion control mechanism. A strategy called Additive Increase/Multiplicative Decrease regulates the number of packets that are sent at one time. When congestion occurs the packets start to drop (multiplicative decrease). TCP's four intertwined congestion control algorithms are: Slow Start, Congestion Avoidance, Fast retransmit, and Fast recovery. In thi...
متن کاملTCP Congestion Control in Fast Long-Distance Networks
TCP congestion control is currently based on Jacobson’s algorithms (slow-start and congestion avoidance), devised back in 1988, with improvements such as SACK and NewReno. Although TCP has proved remarkably flexible thus far and managed to adapt to vastly different types of networks, we show in this paper that some of the assumptions behind these algorithms are no longer valid in today’s fast l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1001.2848 شماره
صفحات -
تاریخ انتشار 2010